#include <bits/stdc++.h>
using namespace std;
int nums[100000];
int tars[10000];
int ans[10000][10000];

int main() {
	int num, tar;
	cin >> num >> tar;
	for (int i = 0; i < num; ++i) {
		cin >> nums[i];
	}
	for (int i = 0; i < tar; ++i) {
		cin >> tars[i];
	}

	return 0;
}

int search(int nums[], int tar) {
	int left = 0;
	int right = sizeof(nums) / sizeof(nums[0]) - 1;
	while (left <= right) {
		int mid = left + (right - left) / 2;
		if (nums[mid] == tar) {
			return mid;
		} else if (tar > nums[tar]) {
			
		}
	}
}